Graph coloring

Results: 948



#Item
311Planar graphs / Graph coloring / Shortest path problem / Matching / Planarity testing / Book:Graph Algorithms / Apollonian network / Graph theory / Theoretical computer science / Mathematics

ICS 163 — Graph Algorithms — Winter Quarter, 1994 Class Hours: Tue/Thur 3:30AM–4:50AM, CS 253 Instructor: David Eppstein Office: CS 448C Phone: Email:

Add to Reading List

Source URL: www.ics.uci.edu

Language: English - Date: 2006-04-27 18:49:38
312Graph / Connected component / Vertex / Connectivity / Graph coloring / Planar separator theorem / Heawood graph / Graph theory / NP-complete problems / Line graph

Managing Large Graphs on Multi-Cores With Graph Awareness Vijayan Prabhakaran, Ming Wu, Xuetian Weng Frank McSherry, Lidong Zhou, Maya Haridasan†∗∗ Microsoft Research, †Google Abstract

Add to Reading List

Source URL: www.usenix.org

Language: English - Date: 2015-05-31 08:44:11
313NP-complete problems / Approximation algorithm / Vertex cover / Travelling salesman problem / Graph coloring / Metric k-center / Dynamic programming / Christofides algorithm / Set cover problem / Theoretical computer science / Mathematics / Computational complexity theory

Algorithms Lecture thesection: Approximation Algorithms [Fa’13] Le mieux est l’ennemi du bien. [The best is the enemy of the good.] — Voltaire, La Bégueule (1772)

Add to Reading List

Source URL: web.engr.illinois.edu

Language: English - Date: 2014-12-28 09:03:25
314Combinatorics / Hypergraph / Duality / Incidence structure / Mathematics / Graph coloring / Theoretical computer science

CCCG 2010, Winnipeg MB, August 9–11, 2010 Coloring geometric hypergraphs defined by an arrangement of half-planes Radoslav Fulek∗† Abstract

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2010-07-19 10:46:15
315NP-complete problems / Parameterized complexity / Kernelization / Path decomposition / Clique / Tree decomposition / Vertex cover / Dominating set / Edge coloring / Graph theory / Theoretical computer science / Mathematics

Open Problems in Parameterized and Exact Computation — IWPEC 2008 Hans L. Bodlaender Erik D. Demaine Michael R. Fellows Jiong Guo

Add to Reading List

Source URL: www.mrfellows.net

Language: English - Date: 2009-10-14 09:04:12
316Geometric graph theory / Outerplanar graph / Graph drawing / Graph coloring / Tree / Graph / Minimum spanning tree / Path decomposition / Angular resolution / Graph theory / Planar graphs / Topological graph theory

CCCG 2011, Toronto ON, August 10–12, 2011 A Note on Minimum-Segment Drawings of Planar Graphs Stephane Durocher ∗†

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2011-08-06 04:11:13
317NP-complete problems / Graph coloring / Vertex cover / Graph isomorphism problem / Matching / Graph operations / Cycle rank / Graph theory / Theoretical computer science / Mathematics

Subexponential Algorithms for Unique Games and Related problems Sanjeev Arora∗ Boaz Barak†

Add to Reading List

Source URL: www.boazbarak.org

Language: English - Date: 2011-10-10 23:52:57
318Network theory / Complex network / Connectivity / Graph / Social networks / Edge coloring / Greedy coloring / Graph theory / Mathematics / Graph coloring

REPORTS An Experimental Study of the Coloring Problem on Human Subject Networks Michael Kearns,* Siddharth Suri, Nick Montfort Theoretical work suggests that structural properties of naturally occurring networks are imp

Add to Reading List

Source URL: www.cis.upenn.edu

Language: English - Date: 2006-10-04 05:37:21
319Combinatorial optimization / Matching / Tree / Graph factorization / Graph coloring / NP-complete problems / Computational problems / Edge coloring / Graph theory / Theoretical computer science / Mathematics

Computing Full Disjunctions∗ (Extended Abstract) Yaron Kanza Yehoshua Sagiv

Add to Reading List

Source URL: www.cs.technion.ac.il

Language: English - Date: 2013-07-05 10:44:30
320Distributed data storage / Analysis of algorithms / Probabilistic complexity theory / Randomized algorithm / Distributed algorithm / Graph coloring / Leader election / Distributed computing / Consensus / Theoretical computer science / Mathematics / Computational complexity theory

16 CHAPTER 2. LEADER ELECTION of each node has the same structure. We will now show that non-uniform anonymous leader election for synchronous rings is impossible. The idea is that

Add to Reading List

Source URL: dcg.ethz.ch

Language: English - Date: 2014-09-26 08:28:48
UPDATE